tree n. 特里〔姓氏〕。 n. 1.樹〔主要指喬木,也可指較大的灌木〕。 ★玫瑰可以稱為 bush, 也可以稱為 tree. 2.木料,木材;木構(gòu)件;〔古語〕絞首臺;〔the tree〕(釘死耶穌的)十字架;鞋楦。 3.樹形(物),世系圖,家系 (=family tree);【數(shù)學(xué)】樹(形);【化學(xué)】樹狀晶體。 a banana tree 香蕉樹。 an axle-tree 心棒,軸料。 a boot-tree 靴楦[型]。 a saddle-tree 鞍架。 at the top of the tree 在最高地位。 tree of Buddha 菩提樹。 tree of heaven 臭椿。 tree of knowledge (of good and evil) 【圣經(jīng)】知道善惡的樹,智慧之樹。 tree of life 生命之樹,生命力的源泉【植物;植物學(xué)】金鐘柏。 up a tree 〔口語〕進(jìn)退兩難,不知所措。 vt. 趕(獵獸等)上樹躲避;〔口語〕使處于困境;窮追;把鞋型插入(鞋內(nèi))。
The successful application of higher order connectedness on tree decomposition leads us to seek further implementation of higher order connectedness to other branches of graph theory 而成功地應(yīng)用高階邊連通性證明樹分解中的問題,使我們進(jìn)一步尋找高階連通性在其它圖論問題中的應(yīng)用。
In the last chapter, we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs, deriving a sufficient condition for a graph to have tree number equivalent to the arboricity 在最后一章中,我們使用高階邊連通度的結(jié)果研究對稱圖中樹分解的一個問題,給出了森林?jǐn)?shù)等于樹數(shù)的一個充分條件。
Fractal coding has been proved useful for image compression . it is also proved effective for content-based image retrieval . in the paper, we present a block-constrained fractal coding scheme and a matching strategy for content-based image retrieval . in this coding scheme, an image is partitioned into non-overlap blocks of a size close to that of a query iconic image . fractal codes are generated for each block independently . in the similarity measure of fractal codes, an improved nona-tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity . our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time 分形編碼在圖像壓縮方面取得了很好的效果,同時,分形編碼也能夠用于基于內(nèi)容的圖像檢索.本文提出了一種基于塊限制的分形編碼算法和匹配策略,并將它們用于圖像檢索.在我們編碼算法中,圖像會被預(yù)先分成互相不重疊的子圖像塊,然后對這些子圖像進(jìn)行獨(dú)立地分形編碼,從而獲得整幅圖像的分形碼.該編碼算法能夠在很大程度上減少編碼時間.在進(jìn)行圖像間相似性的匹配時,我們采用改進(jìn)的基于九叉樹的分配策略,從而避免全局地進(jìn)行分形碼的匹配,減少了計算量.實(shí)驗(yàn)結(jié)果說明,我們的編碼算法和匹配策略能夠比較有效地應(yīng)用于基于內(nèi)容的圖像檢索,在計算時間和存儲時間上都優(yōu)于實(shí)驗(yàn)中其它兩種方法